FAST ONE-PARAMETER RELAXATION METHOD WITH A SCALED PRECONDITIONER FOR SADDLE POINT PROBLEMS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast One-Parameter Variant of Preconditioned Uzawa Method with a Scaled Preconditioner for Saddle Point Problems

In this paper, we propose a fast one-parameter variant of preconditioned Uzawa (OVPU) method with a scaled preconditioner for solving the saddle point problems, and then we present its convergence region and a formula for finding its optimal parameter. Also performance of the proposed OVPU method with a scaled preconditioner is compared with the existing one or two parameter iterative methods w...

متن کامل

A BDDC Preconditioner for Saddle Point Problems

The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...

متن کامل

A Preconditioner for Generalized Saddle Point Problems

In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditioned matrix are established. The potential of this approach is illustrated by numerical experiments with matrices fro...

متن کامل

Acceleration of One-parameter Relaxation Methods for Singular Saddle Point Problems

In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR m...

متن کامل

A Parameterized Splitting Preconditioner for Generalized Saddle Point Problems

By using Sherman-Morrison-Woodbury formula, we introduce a preconditioner based on parameterized splitting idea for generalized saddle point problems which may be singular and nonsymmetric. By analyzing the eigenvalues of the preconditioned matrix, we find that when α is big enough, it has an eigenvalue at 1 with multiplicity at least n, and the remaining eigenvalues are all located in a unit c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of applied mathematics & informatics

سال: 2016

ISSN: 1598-5857

DOI: 10.14317/jami.2016.085